On the multidimensional distribution of the subset sum generator of pseudorandom numbers
نویسندگان
چکیده
We show that for a random choice of the parameters, the subset sum pseudorandom number generator produces a sequence of uniformly and independently distributed pseudorandom numbers. The result can be useful for both cryptographic and quasi-Monte Carlo applications and relies on bounds of exponential sums.
منابع مشابه
On the Distribution of the Elliptic Subset Sum Generator of Pseudorandom Numbers
We show that for almost all choices of parameters, the elliptic subset sum pseudorandom number generator produces a sequence of uniformly distributed pseudorandom numbers. The result is useful for both cryptographic and Quasi Monte Carlo applications and relies on bounds of exponential sums.
متن کاملOn the Average Distribution of Inversive Pseudorandom Numbers
The inversive congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. The authors have recently introduced a new method for obtaining nontrivial upper bounds on the multidimensional discrepancy of inversive congruential pseudorandom numbers in parts of the period. This method has also been used to study the multidimensiona...
متن کاملOn the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves
Given a prime p, an elliptic curve E/Fp over the finite field Fp of p elements and a binary linear recurrence sequence (u(n))∞n=1 of order r, we study the distribution of the sequence of points r−1 ∑ j=0 u(n+ j)Pj , n = 1, . . . , N, on average over all possible choices of Fp-rational points P1, . . . , Pr on E . For a sufficiently large N we improve and generalise a previous result in this dir...
متن کاملPseudorandom Generator Based on Hard Lattice Problem
This paper studies how to construct a pseudorandom generator using hard lattice problems. We use a variation of the classical hard problem Inhomogeneous Small Integer Solution ISIS of lattice, say Inhomogeneous Subset Sum Solution ISSS. ISSS itself is a hash function. Proving the preimage sizes ISSS hash function images are almost the same, we construct a pseudorandom generator using the method...
متن کاملCryptanalysis of Pseudorandom Generators
As a motivating application for the study of lattice in cryptography we consider the construction of pseudorandom generators. We recall that a pseudorandom generator is a program G(x) (computable in deterministic polynomial time) that maps bitstrings x ∈ {0, 1} to longer strings G(x) ∈ {0, 1} such that, if x is chosen uniformly at random and kept secret, then the output G(x) will “look” random ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 73 شماره
صفحات -
تاریخ انتشار 2004